New Evaluation Index of Orderings in Incomplete Factorization Preconditioning

نویسندگان

  • Takeshi Iwashita
  • Masaaki Shimasaki
چکیده

| It is well known that ordering of unknowns greatly a ects convergence in Incomplete LU (ILU) factorization preconditioned iterative methods. The authors recently proposed a simple evaluation way for orderings in ILU preconditioning. The evaluation index, which has a simple relationship with a norm of a remainder matrix, is easily computed without additional memory requirement. The computational cost of the index is about the same as that of ILU factorization. The e ectiveness of the method is examined by numerical tests using coeÆcient matrix data obtained from Matrix Market.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices

Standard preconditioning techniques based on incomplete LU (ILU) factorizations offer a limited degree of parallelism, in general. A few of the alternatives advocated so far consist of either using some form of polynomial preconditioning, or applying the usual ILU factorization to a matrix obtained from a multicolor ordering. In this paper we present an incomplete factorization technique based ...

متن کامل

Numerical Experiments with Parallel Orderings for Ilu Preconditioners

Incomplete factorization preconditioners such as ILU, ILUT and MILU are well-known robust general-purpose techniques for solving linear systems on serial computers. However, they are difficult to parallelize efficiently. Various techniques have been used to parallelize these preconditioners, such as multicolor orderings and subdomain preconditioning. These techniques may degrade the performance...

متن کامل

Pii: S0168-9274(98)00133-0

Incomplete factorization preconditioners based on recursive red–black orderings have been shown efficient for discrete second order elliptic PDEs with isotropic coefficients. However, they suffer for some weakness in presence of anisotropy or grid stretching. Here we propose to combine these orderings with block incomplete factorization preconditioning techniques. For implementation considerati...

متن کامل

Effective Preconditioning through Ordering Interleaved with Incomplete Factorization

Consider the solution of a sparse linear system Ax = b when the matrix A is symmetric and positive definite. A typical iterative solver is obtained by using the method of Conjugate Gradients (CG) [15] preconditioned with an incomplete Cholesky (IC) factor L̂ [4]. The latter is an approximation to the (complete) Cholesky factor L, where A = LL . Consequently, the process of computing L̂ relies to ...

متن کامل

A nearly optimal preconditioning based on recursive red-black orderings

Considering matrices obtained by the application of a five-point stencil on a 2D rectangular grid, we analyse a preconditioning method introduced by Axelsson and Eijkhout, and by Brand and Heinemann. In this method, one performs a (modified) incomplete factorization with respect to a so-called ‘repeated’ or ‘recursive’ red– black ordering of the unknowns while fill-in is accepted provided that ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005